Structuring Computer Generated Proofs
نویسنده
چکیده
One of the main disadvantages of computer generated proofs of mathematical theorems is their complexity and incomprehensibility. Proof transformation proce- dures have been designed in order to state these proofs in a formalism that is more familiar to a human ma- thematician. But usually the essential idea of a proof is still not easily visible. We describe a procedure to transform proofs represented as abstract refutation graphs into natural deduction proofs. During this process topological properties of the refutation graphs can be exploited in order to obtain structured proofs.
منابع مشابه
Structuring of Computer-Generated Proofs by Cut Introduction
As modern Automated Deduction systems rely heavily on the use of a machine-oriented representation of a given problem, together with sophisticated redundancy-avoiding techniques, a major task in convincing human users of the correctness of automatically generated proofs is the intelligible representation of these proofs. In this paper, we propose the use of the cut-rule in the human-oriented pr...
متن کاملProject Presentation: Algorithmic Structuring and Compression of Proofs (ASCOP)
Computer-generated proofs are typically analytic, i.e. they essentially consist only of formulas which are present in the theorem that is shown. In contrast, mathematical proofs written by humans almost never are: they are highly structured due to the use of lemmas. The ASCOP-project aims at developing algorithms and software which structure and abbreviate analytic proofs by computing useful le...
متن کاملStructuring Interactive Correctness Proofs by Formalizing Coding Idioms
This paper examines a novel strategy for developing correctness proofs in interactive software verification for C programs. Rather than proceeding backwards from the generated verification conditions, we start by developing a library of the employed data structures and related coding idioms. The application of that library then leads to correctness proofs that reflect informal arguments about t...
متن کاملInheritance of Proofs
The Curry-Howard isomorphism, a fundamental property shared by many type theories, establishes a direct correspondence between programs and proofs. This suggests that the same structuring principles that ease programming be used to simplify proving as well. To exploit object-oriented structuring mechanisms for veriication, we extend the object-model of Pierce and Turner, based on the higher-ord...
متن کاملLearner Engagement with Structuring and Problematizing in Scaffolded Writing Tasks: A Mixed-MethodsMultiple Case Study
The present study set out to delineate to what extentfive intermediate learners engaged in structuring and problematizing scaffolding in two writing tasks. The study aimed at illuminating how the participants engaged with structuring and problematizing scaffolds cognitively, behaviorally, and affectively. Learners’ written essays, think-aloud protocols, and interviews shaped the data sources w...
متن کامل